A Survey on Learnable Evolutionary Algorithms for Scalable Multiobjective Optimization

نویسندگان

چکیده

Recent decades have witnessed great advancements in multiobjective evolutionary algorithms (MOEAs) for optimization problems (MOPs). However, these progressively improved MOEAs not necessarily been equipped with scalable and learnable problem-solving strategies new grand challenges brought by the scaling-up MOPs continuously increasing complexity from diverse aspects, mainly including expensive cost of function evaluations, many objectives, large-scale search space, time-varying environments, multi-task. Under different scenarios, divergent thinking is required designing powerful solving them effectively. In this context, research studies on machine learning techniques received extensive attention field computation. This paper begins a general taxonomy MOEAs, followed an analysis that pose to traditional MOEAs. Then, we synthetically overview recent advances various MOPs, focusing primarily four attractive directions (i.e., discriminators environmental selection, generators reproduction, evaluators transfer modules sharing or reusing experience). The insight offered readers as reference track efforts field.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Algorithms for Multiobjective Optimization

Multiple, often conflicting objectives arise naturally in most real-world optimization scenarios. As evolutionary algorithms possess several characteristics due to which they are well suited to this type of problem, evolution-based methods have been used for multiobjective optimization for more than a decade. Meanwhile evolutionary multiobjective optimization has become established as a separat...

متن کامل

Multiobjective optimization using evolutionary algorithms

Evolutionary algorithms (EAs) such as evolution strategies and genetic algorithms have become the method of choice for optimization problems that are too complex to be solved using deterministic techniques such as linear programming or gradient (Jacobian) methods. The large number of applications (Beasley (1997)) and the continuously growing interest in this field are due to several advantages ...

متن کامل

Decomposition evolutionary algorithms for noisy multiobjective optimization

Multi-objective problems are a category of optimization problem that contains more than one objective function and these objective functions must be optimized simultaneously. Should the objective functions be conflicting, then a set of solutions instead of a single solution is required. This set is known as Pareto optimal. Multi-objective optimization problems arise in many real world applicati...

متن کامل

A Review towards Evolutionary Multiobjective optimization Algorithms

Multi objective optimization is a promising field which is increasingly being encountered in many areas worldwide. Various metaheuristic techniques such as differential evolution (DE), genetic algorithm (GA), gravitational search algorithm (GSA), and particle swarm optimization (PSO) have been used to solve Multi objective problems. Various multiobjective evolutionary algorithms have been devel...

متن کامل

Analysis and Applications of Evolutionary Multiobjective Optimization Algorithms Analysis and Applications of Evolutionary Multiobjective Optimization Algorithms

This thesis deals with the analysis and application of evolutionary algorithms for optimization problems with multiple objectives. Many application problems involve (i) a system model that is not given in closed analytical form and (ii) multiple, often conflicting optimization criteria. Both traits hamper the appli¬ cation of classical optimization techniques, which require a certain structure ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Evolutionary Computation

سال: 2023

ISSN: ['1941-0026', '1089-778X']

DOI: https://doi.org/10.1109/tevc.2023.3250350